Formalization of Generative Unbinding
نویسنده
چکیده
Pitts and Shinwell introduced an idealized programming language containing constructs for binding and also for pattern matching against this binding construct. They prove a result about which operations on names can co-exist with the binding construct in this language. What makes this construct interesting is that it generates a new name at the moment of “unbinding”. In this report we describe a formalization for some of the results of Pitts and Shinwell.
منابع مشابه
What Is a Natural Language and How to Describe It? Meaning-Text Approaches in Contrast with Generative Approaches (Invited Talk)
The paper expounds the general conceptions of the MeaningText theory about what a natural language is and how it must be described. In a second part, a formalization of these conceptions— the transductive grammars—is proposed and compared with generative approaches.
متن کاملOn the Semantics of Generative Geometry Representations
We argue that geometry constructs and solid operations currently under development in feature-based CAD systems are without an appropri. ate semantic foundation. and that a rigorous semantics poses significant research problems. In particular. we argue that a formalization of feature altachment and other generative constructs cannot be based solely on conventional boundary representation or on ...
متن کاملA Statistical Theory of Dependency Syntax
A generative statistical model of dependency syntax is proposed based on Tesni ere's classical theory. It provides a stochastic formalization of the original model of syntactic structure and augments it with a model of the string realization process, the latter which is lacking in Tesni ere's original work. The resulting theory models crossing dependency links, discontinuous nuclei and string m...
متن کاملChapter 1 The Evolution of Model - Theoretic Frameworks in Linguistics 1
The varieties of mathematical basis for formalizing linguistic theories are more diverse than is commonly realized. For example, the later work of Zellig Harris might well suggest a formalization in terms of CATEGORY THEORY, since Harris takes the utterances of a language to constitute a collection (possibly not even enumerable) that is not itself of particular interest, and concentrates on dis...
متن کاملFunctional Generative Description, Restarting Automata and Analysis by Reduction
Functional Generative Description (FGD is a dependency based system for Czech, whose beginnings date back to the 1960s (see esp. Sgall et al. 1969, Sgall et al. 1986). FGD may be of some interest for the description of most Slavic languages, since it is adapted to treat a high degree of free word order. It not only specifies surface structures of the given sentences, but also translates them in...
متن کامل